By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Search This Issue
Volume 12, Issue 4, pp. 413-534

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Complexes of Directed Graphs

Anders Björner and Volkmar Welker

pp. 413-424

BibTeX  Abstract Full Text:  PDF

A 3/2-Approximation Algorithm for the Mixed Postman Problem

Balaji Raghavachari and Jeyakesavan Veerasamy

pp. 425-433

BibTeX  Abstract Full Text:  PDF

On the Contour of Random Trees

Bernhard Gittenberger

pp. 434-458

BibTeX  Abstract Full Text:  PDF

The Compactness of Interval Routing

Cyril Gavoille and David Peleg

pp. 459-473

BibTeX  Abstract Full Text:  PDF

Determinant: Old Algorithms, New Insights

Meena Mahajan and V. Vinay

pp. 474-490

BibTeX  Abstract Full Text:  PDF

Star Extremal Circulant Graphs

Ko-Wei Lih, Daphne Der-Fen Liu, and Xuding Zhu

pp. 491-499

BibTeX  Abstract Full Text:  PDF

Graph Partitioning and Continuous Quadratic Programming

William W. Hager and Yaroslav Krylyuk

pp. 500-523

BibTeX  Abstract Full Text:  PDF

On the Size of Minimum Super Arrovian Domains

Samit Dasgupta

pp. 524-534

BibTeX  Abstract Full Text:  PDF